Search results for "Recursively enumerable set"

Enumerable classes of total recursive functions: Complexity of inductive inference

1994

This paper includes some results on complexity of inductive inference for enumerable classes of total recursive functions, where enumeration is considered in more general meaning than usual recursive enumeration. The complexity is measured as the worst-case mindchange (error) number for the first n functions of the given class. Three generalizations are considered.